New Results for Sets of Boolean Functions
نویسندگان
چکیده
Traditionally Sum-Of-Products (SOPs) have been studied as expressions of Boolean functions. It has been shown by Sasao in [7] that Exclusive-or-Sum-Of-Products (ESOPs) are more compact representations of Boolean functions than SOPs. The problem to identify an exact minimal ESOP of a Boolean function is despite of some partial results still unsolved. Our new results rely on recently detected properties of Boolean functions and extend the set of Boolean functions for which an exact minimal ESOP can be constructed.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملSemi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices
At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...
متن کاملDecomposition of Boolean Function Sets for Boolean Neural Networks
This paper presents a new type of neuron, called Boolean neuron. We suggest algorithms for decomposition of Boolean functions sets based on Boolean neural networks that include only Boolean neurons. The advantages of these neural networks consist in the reduction of memory space and computation time in comparison to the representation of Boolean functions by usual neural networks. The Boolean n...
متن کاملTowards efficient constructions of hitting sets that derandomize BPP
A subset H f0; 1g n is a Hitting Set for a class R of boolean functions with n inputs if, for any function f 2 R such that Pr (f = 1) (where 2 (0; 1) is some xed value), there exists an element ~ h 2 H such that f (~ h) = 1. The eecient construction of Hitting Sets for non trivial classes of boolean functions is a fundamental problem in the theory of derandomization. Our paper presents a new me...
متن کامل